Split and Non-Split Dominator Chromatic Numbers and Related Parameters
نویسندگان
چکیده
منابع مشابه
Generalized Split Graphs and Ramsey Numbers
A graph G is called a ( p, q)-split graph if its vertex set can be partitioned into A, B so that the order of the largest independent set in A is at most p and the order of the largest complete subgraph in B is at most q. Applying a well-known theorem of Erdo s and Rado for 2-systems, it is shown that for fixed p, q, ( p, q)-split graphs can be characterized by excluding a finite set of forbidd...
متن کاملNon-Newtonian Fuzzy numbers and related applications
Although there are many excellent ways presenting the principle of the classical calculus, the novel presentations probably leads most naturally to the development of the non-Newtonian calculus. The important point to note is that the non-Newtonian calculus is a self-contained system independent of any other system of calculus. Since this self-contained work is intended for a wide audience, inc...
متن کاملNon-minimal Split Supersymmetry
We present an extension of the minimal split supersymmetry model, which is capable of explaining the baryon asymmetry of the Universe. Instead of MSSM we start from NMSSM and split its spectrum in such a way that the low energy theory contains neutral particles, in addition to the content of minimal split supersymmetry. They trigger the strongly first order electroweak phase transition (EWPT) a...
متن کاملAnti-Ramsey numbers in complete split graphs
A subgraph of an edge-coloured graph is rainbow if all of its edges have different colours. For graphs G and H the anti-Ramsey number ar(G,H) is the maximum number of colours in an edge-colouring of G with no rainbow copy of H. The notion was introduced by Erdős, Simonovits and V. Sós and studied in case G = Kn. Afterwards exact values or bounds for anti-Ramsey numbers ar(Kn, H) were establishe...
متن کاملSplit-critical and uniquely split-colorable graphs
The split-coloring problem is a generalized vertex coloring problem where we partition the vertices into a minimum number of split graphs. In this paper, we study some notions which are extensively studied for the usual vertex coloring and the cocoloring problem from the point of view of split-coloring, such as criticality and the uniqueness of the minimum split-coloring. We discuss some proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mapana - Journal of Sciences
سال: 2011
ISSN: 0975-3303,0975-3303
DOI: 10.12723/mjs.18.5